skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Arman, Andrii"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, The Electronic Journal of Combinatorics)
    In this paper we make a partial progress on the following conjecture: for every $$\mu>0$$ and large enough $$n$$, every Steiner triple system $$S$$ on at least $$(1+\mu)n$$ vertices contains every hypertree $$T$$ on $$n$$ vertices. We prove that the conjecture holds if $$T$$ is a perfect $$d$$-ary hypertree. 
    more » « less
    Full Text Available 
  2. ; ; (, The electronic journal of combinatorics)
    Full Text Available 
  3. ; (, Discrete mathematics)
    null (Ed.)
    Full Text Available